Specific Tuning Parameter for Directed Random Walk Algorithm Cancer Classification
نویسندگان
چکیده
منابع مشابه
Topologically inferring risk-active pathways toward precise cancer classification by directed random walk
MOTIVATION The accurate prediction of disease status is a central challenge in clinical cancer research. Microarray-based gene biomarkers have been identified to predict outcome and outperform traditional clinical parameters. However, the robustness of the individual gene biomarkers is questioned because of their little reproducibility between different cohorts of patients. Substantial progress...
متن کاملDiscriminative Deep Random Walk for Network Classification
Deep Random Walk (DeepWalk) can learn a latent space representation for describing the topological structure of a network. However, for relational network classification, DeepWalk can be suboptimal as it lacks a mechanism to optimize the objective of the target task. In this paper, we present Discriminative Deep Random Walk (DDRW), a novel method for relational network classification. By solvin...
متن کاملRandom Walk on Directed Dynamic Graphs
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the undirected dynamic graph model. However, realistic networks such as the ones identified above are directed. In this paper we present early work in addressing th...
متن کاملZeros of a two-parameter random walk∗
We prove that the number γN of the zeros of a two-parameter simple random walk in its first N × N time steps is almost surely equal to N as N →∞. This is in contrast with our earlier joint effort with Z. Shi [4]; that work shows that the number of zero crossings in the first N × N time steps is N (3/2)+o(1) as N → ∞. We prove also that the number of zeros on the diagonal in the first N time ste...
متن کاملAnalyzing the Random-Walk Algorithm for SAT
The propositional logic satisfiability (SAT) problem has gained growing interest in recent years. From complexity theory is known that many real-world mathematical and engineering problems can be translated into SAT problem instances. Advances on SAT solution algorithms in the past ten or fifteen years has enabled solving these problems by a computer. This, for one, has inspired developing even...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Advanced Science, Engineering and Information Technology
سال: 2017
ISSN: 2460-6952,2088-5334
DOI: 10.18517/ijaseit.7.1.1588